Optimal lower bounds for some distributed algorithms for a complete network of processors
نویسندگان
چکیده
منابع مشابه
Some lower bounds for the $L$-intersection number of graphs
For a set of non-negative integers~$L$, the $L$-intersection number of a graph is the smallest number~$l$ for which there is an assignment of subsets $A_v subseteq {1,dots, l}$ to vertices $v$, such that every two vertices $u,v$ are adjacent if and only if $|A_u cap A_v|in L$. The bipartite $L$-intersection number is defined similarly when the conditions are considered only for the ver...
متن کاملCommunication lower bounds and optimal algorithms for numerical linear algebra
Acta Numerica / Volume 23 / May 2014, pp 1 155 DOI: 10.1017/S0962492914000038, Published online: 12 May 2014 Link to this article: http://journals.cambridge.org/abstract_S0962492914000038 How to cite this article: G. Ballard, E. Carson, J. Demmel, M. Hoemmen, N. Knight and O. Schwartz (2014). Communication lower bounds and optimal algorithms for numerical linear algebra . Acta Numerica, 23, pp ...
متن کاملsome lower bounds for the $l$-intersection number of graphs
for a set of non-negative integers~$l$, the $l$-intersection number of a graph is the smallest number~$l$ for which there is an assignment of subsets $a_v subseteq {1,dots, l}$ to vertices $v$, such that every two vertices $u,v$ are adjacent if and only if $|a_u cap a_v|in l$. the bipartite $l$-intersection number is defined similarly when the conditions are considered only for the ver...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 1989
ISSN: 0304-3975
DOI: 10.1016/0304-3975(89)90103-5